Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles

نویسندگان

  • Janez vZerovnik
  • Rija Ervevs
چکیده

Mixed fault diameter of a graph G, D(a,b)(G), is the maximal diameter of G after deletion of any a vertices and any b edges. Special cases are the (vertex) fault diameter D a = D(a,0) and the edge fault diameter D E a = D(0,a). Let G be a Cartesian graph bundle with fibre F over the base graph B. We show that (1) D a+b+1(G) ≤ D V a (F )+D V b (B) when the graphs F and B are kF -connected and kB-connected, 0 < a < kF , 0 < b < kB , and provided that D(a−1,1)(F ) ≤ D V a (F ) and D(b−1,1)(B) ≤ D V b (B) and (2) D a+b+1(G) ≤ D E a (F ) + D E b (B) when the graphs F and B are kF -edge connected and kB-edge connected, 0 ≤ a < kF , 0 ≤ b < kB , and provided that D a (F ) ≥ 2 and D E b (B) ≥ 2.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles

Mixed fault diameter of a graph G, D(a,b)(G), is the maximal diameter of G after deletion of any a vertices and any b edges. Special cases are the (vertex) fault diameter D a = D(a,0) and the edge fault diameter D E a = D(0,a). Let G be a Cartesian graph bundle with fibre F over the base graph B. We show that (1) D a+b+1(G) ≤ D V a (F )+D V b (B) when the graphs F and B are kF -connected and kB...

متن کامل

Fault diameters of graph products and bundles

Fault tolerance and transmission delay of networks are important concepts in network design. The notions are strongly related to connectivity and diameter of a graph, and have been studied by many authors. Wide diameter of a graph combines studying connectivity with the diameter of a graph. Diameter with width k of a graph G is defined as the minimum integer d for which there exist at least k i...

متن کامل

Sharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs

In $1994,$ degree distance  of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of  multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the  multiplicative version of degree distance and multiplicative ver...

متن کامل

Some results on vertex-edge Wiener polynomials and indices of graphs

The vertex-edge Wiener polynomials of a simple connected graph are defined based on the distances between vertices and edges of that graph. The first derivative of these polynomials at one are called the vertex-edge Wiener indices. In this paper, we express some basic properties of the first and second vertex-edge Wiener polynomials of simple connected graphs and compare the first and second ve...

متن کامل

On the edge geodetic and edge geodetic domination numbers of a graph

In this paper, we study both concepts of geodetic dominatingand edge geodetic dominating sets and derive some tight upper bounds onthe edge geodetic and the edge geodetic domination numbers. We also obtainattainable upper bounds on the maximum number of elements in a partitionof a vertex set of a connected graph into geodetic sets, edge geodetic sets,geodetic domin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012